与自然语言处理的XAI旨在产生可读的解释，作为AI决策的证据，以解决解释性和透明度。但是，从HCI的角度来看，当前的方法仅着眼于提供单一的解释，该解释无法解决人类思想和语言经验的多样性。因此，本文通过提出一个生成XAI框架，交互来解决此差距（解释并预测与上下文条件变分自动编码器查询）。我们的新框架分为两个步骤提供了解释：（一步）解释和标签预测； （第二步）各种证据生成。我们在基准数据集E-SNLI上对变压器体系结构进行密集实验。我们的方法在第一步中，针对解释生成（BLEU的增长率高达4.7％）的最先进基线模型的竞争性或更好的表现；它还可以在第二步中产生多种不同的解释。

巨大的开放在线课程（MooCs）已成为电子学习的热门选择，因为他们的灵活性很大。但是，由于大量的学习者及其多样化的背景，它征税，以提供实时支持。学习者可能会在各自的MooC论坛上发布他们的混乱和斗争，但随着MooC教师的大量员额和高工作量，教师不太可能识别所有需要干预的学习者。由于数据的不平衡和任务的复杂性，已被研究是一种自然语言处理（NLP）问题的研究，并且已知是具有挑战性的。在本文中，我们探讨了贝叶斯的第一次对学习者的文本帖子进行了两种方法：蒙特卡罗辍学和变分推论，作为评估学习者帖子的教师干预需求的新解决方案。我们基于在类似情况下基于概率模型的基于概率模型的概率模型进行比较模型，对于应用预测的不同情况。结果表明，贝叶斯深度学习提供了传统神经网络未提供的批判性不确定性措施。这增加了对AI的说明，信任和稳健性，这在基于教育的应用中至关重要。另外，与非概率神经网络相比，它可以实现类似或更好的性能，以及较低的方差。

For time-critical IoT applications using deep learning, inference acceleration through distributed computing is a promising approach to meet a stringent deadline. In this paper, we implement a working prototype of a new distributed inference acceleration method HALP using three raspberry Pi 4. HALP accelerates inference by designing a seamless collaboration among edge devices (EDs) in Edge Computing. We maximize the parallelization between communication and computation among the collaborative EDs by optimizing the task partitioning ratio based on the segment-based partitioning. Experimental results show that the distributed inference HALP achieves 1.7x inference acceleration for VGG-16. Then, we combine distributed inference with conventional neural network model compression by setting up different shrinking hyperparameters for MobileNet-V1. In this way, we can further accelerate inference but at the cost of inference accuracy loss. To strike a balance between latency and accuracy, we propose dynamic model selection to select a model which provides the highest accuracy within the latency constraint. It is shown that the model selection with distributed inference HALP can significantly improve service reliability compared to the conventional stand-alone computation.

有两种流行的损失功能用于视觉检索，即三胞胎损失和对比度学习损失，这两者本质上都可以最大程度地减少负对和正对的相似性之间的差异。更具体地说，在现有的检索模型中广泛使用的硬采矿（三重态HN）的三胞胎损失很容易落入训练中的局部最小值。另一方面，广泛用于视觉的预训练中的视觉对比学习损失（VLC）已被证明可以在视觉语言检索上获得显着的性能提高，但通过使用微调的性能来实现。小型数据集上的VLC并不令人满意。本文提出了对视觉语言检索的统一损失相似性优化，为理解现有的损失功能提供了强大的工具。我们的统一损失包括VLC的硬样品挖掘策略，并引入了三胞胎损失使用的边距，以获得更好的相似性分离。结果表明，三重态HN和VLC都是我们统一损失的特殊形式。与三胞胎-HN相比，我们的统一损失具有快速的收敛速度。与VLC相比，我们的统一损失更具歧视性，可以在下游微调任务中更好地概括。图像文本和视频检索基准测试的实验表明，我们的统一损失可以显着提高最新检索模型的性能。

知识驱动的对话世代最近取得了非凡的突破。与一般的对话系统相比，卓越的知识对话系统可以通过预先提供的知识产生更多信息和知识渊博的响应。但是，在实际应用中，对话系统无法事先提供相应的知识。为了解决该问题，我们设计了一个名为DRKQG的知识驱动的对话系统（\ emph {通过查询生成动态检索知识，以获取信息性对话响应}）。具体而言，系统可以分为两个模块：查询生成模块和对话生成模块。首先，利用时间感知机制来捕获上下文信息，并可以生成查询以检索知识。然后，我们集成了复制机制和变压器，该机制允许响应生成模块产生从上下文和检索知识中得出的响应。 LIC2022，语言和情报技术竞赛的实验结果表明，我们的模块在自动评估指标上的大幅度优于基线模型，而BAIDU语言学团队的人类评估表明，我们的系统在事实上取得了令人印象深刻的结果，实际上是正确的，知识渊博。

In this paper, we propose a robust 3D detector, named Cross Modal Transformer (CMT), for end-to-end 3D multi-modal detection. Without explicit view transformation, CMT takes the image and point clouds tokens as inputs and directly outputs accurate 3D bounding boxes. The spatial alignment of multi-modal tokens is performed implicitly, by encoding the 3D points into multi-modal features. The core design of CMT is quite simple while its performance is impressive. CMT obtains 73.0% NDS on nuScenes benchmark. Moreover, CMT has a strong robustness even if the LiDAR is missing. Code will be released at https://github.com/junjie18/CMT.

Given the increasingly intricate forms of partial differential equations (PDEs) in physics and related fields, computationally solving PDEs without analytic solutions inevitably suffers from the trade-off between accuracy and efficiency. Recent advances in neural operators, a kind of mesh-independent neural-network-based PDE solvers, have suggested the dawn of overcoming this challenge. In this emerging direction, Koopman neural operator (KNO) is a representative demonstration and outperforms other state-of-the-art alternatives in terms of accuracy and efficiency. Here we present KoopmanLab, a self-contained and user-friendly PyTorch module of the Koopman neural operator family for solving partial differential equations. Beyond the original version of KNO, we develop multiple new variants of KNO based on different neural network architectures to improve the general applicability of our module. These variants are validated by mesh-independent and long-term prediction experiments implemented on representative PDEs (e.g., the Navier-Stokes equation and the Bateman-Burgers equation) and ERA5 (i.e., one of the largest high-resolution data sets of global-scale climate fields). These demonstrations suggest the potential of KoopmanLab to be considered in diverse applications of partial differential equations.

Rankings are widely collected in various real-life scenarios, leading to the leakage of personal information such as users' preferences on videos or news. To protect rankings, existing works mainly develop privacy protection on a single ranking within a set of ranking or pairwise comparisons of a ranking under the $\epsilon$-differential privacy. This paper proposes a novel notion called $\epsilon$-ranking differential privacy for protecting ranks. We establish the connection between the Mallows model (Mallows, 1957) and the proposed $\epsilon$-ranking differential privacy. This allows us to develop a multistage ranking algorithm to generate synthetic rankings while satisfying the developed $\epsilon$-ranking differential privacy. Theoretical results regarding the utility of synthetic rankings in the downstream tasks, including the inference attack and the personalized ranking tasks, are established. For the inference attack, we quantify how $\epsilon$ affects the estimation of the true ranking based on synthetic rankings. For the personalized ranking task, we consider varying privacy preferences among users and quantify how their privacy preferences affect the consistency in estimating the optimal ranking function. Extensive numerical experiments are carried out to verify the theoretical results and demonstrate the effectiveness of the proposed synthetic ranking algorithm.

Due to their ability to offer more comprehensive information than data from a single view, multi-view (multi-source, multi-modal, multi-perspective, etc.) data are being used more frequently in remote sensing tasks. However, as the number of views grows, the issue of data quality becomes more apparent, limiting the potential benefits of multi-view data. Although recent deep neural network (DNN) based models can learn the weight of data adaptively, a lack of research on explicitly quantifying the data quality of each view when fusing them renders these models inexplicable, performing unsatisfactorily and inflexible in downstream remote sensing tasks. To fill this gap, in this paper, evidential deep learning is introduced to the task of aerial-ground dual-view remote sensing scene classification to model the credibility of each view. Specifically, the theory of evidence is used to calculate an uncertainty value which describes the decision-making risk of each view. Based on this uncertainty, a novel decision-level fusion strategy is proposed to ensure that the view with lower risk obtains more weight, making the classification more credible. On two well-known, publicly available datasets of aerial-ground dual-view remote sensing images, the proposed approach achieves state-of-the-art results, demonstrating its effectiveness. The code and datasets of this article are available at the following address: https://github.com/gaopiaoliang/Evidential.

A noisy training set usually leads to the degradation of the generalization and robustness of neural networks. In this paper, we propose a novel theoretically guaranteed clean sample selection framework for learning with noisy labels. Specifically, we first present a Scalable Penalized Regression (SPR) method, to model the linear relation between network features and one-hot labels. In SPR, the clean data are identified by the zero mean-shift parameters solved in the regression model. We theoretically show that SPR can recover clean data under some conditions. Under general scenarios, the conditions may be no longer satisfied; and some noisy data are falsely selected as clean data. To solve this problem, we propose a data-adaptive method for Scalable Penalized Regression with Knockoff filters (Knockoffs-SPR), which is provable to control the False-Selection-Rate (FSR) in the selected clean data. To improve the efficiency, we further present a split algorithm that divides the whole training set into small pieces that can be solved in parallel to make the framework scalable to large datasets. While Knockoffs-SPR can be regarded as a sample selection module for a standard supervised training pipeline, we further combine it with a semi-supervised algorithm to exploit the support of noisy data as unlabeled data. Experimental results on several benchmark datasets and real-world noisy datasets show the effectiveness of our framework and validate the theoretical results of Knockoffs-SPR. Our code and pre-trained models will be released.